Onsager’s Conjecture Almost Everywhere in Time
نویسندگان
چکیده
منابع مشابه
Almost-Everywhere Complexity Hierarchies for Nondeterministic Time
A preliminary version of this work appeared as [2]. y Supported in part by National Science Foundation grant CCR-9000045. Some of this research was performed while the author was a visiting professor at Institut f ur Informatik, Universit at W urzburg, D-8700 W urzburg, Federal Republic of Germany. z Supported in part by the National Science Foundation grants CCR-8808949 and CCR-8958528. Wo...
متن کاملAlmost-Everywhere Superiority for Quantum Polynomial Time
Simon [Sim97] as extended by Brassard and Høyer [BH97] shows that there are tasks on which polynomial-time quantum machines are exponentially faster than each classical machine infinitely often. The present paper shows that there are tasks on which polynomial-time quantum machines are exponentially faster than each classical machine almost everywhere.
متن کاملIncentive Compatibility: Everywhere vs. Almost Everywhere∗
A risk neutral buyer observes a private signal s ∈ [a, b], which informs her that the mean and variance of a normally distributed risky asset are s and σ s respectively. She then sets a price at which to acquire the asset owned by risk averse “outsiders”. Assume σ s ∈ { 0, σ } for some σ > 0 and let B = { s ∈ [a, b] | σ s = 0 } . If B = ∅, then there exists a fully revealing equilibrium in whic...
متن کاملAlmost-Everywhere Secure Computation
Secure multi-party computation (MPC) is a central problem in cryptography. Unfortunately, it is well known that MPC is possible if and only if the underlying communication network has very large connectivity — in fact, , where is the number of potential corruptions in the network. This impossibility result renders existing MPC results far less applicable in practice, since many deployed network...
متن کاملAlmost everywhere domination
A Turing degree a is said to be almost everywhere dominating if, for almost all X ∈ 2 with respect to the “fair coin” probability measure on 2, and for all g : ω → ω Turing reducible to X, there exists f : ω → ω of Turing degree a which dominates g. We study the problem of characterizing the almost everywhere dominating Turing degrees and other, similarly defined classes of Turing degrees. We r...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Communications in Mathematical Physics
سال: 2015
ISSN: 0010-3616,1432-0916
DOI: 10.1007/s00220-014-2262-z